An Improved Apriori Algorithm based on Matrix Data Structure

Mining regular/frequent itemsets is very important concept in association rule mining which shows association among the variables in huge database. the classical algorithm used for extracting regular itemsets faces two fatal deficiencies .firstly it scans the database multiple times and secondly it generates large number of irregular itemsets hence increases spatial and temporal complexties and overall decreases the efficiency of classical apriori algorithm.to overcome the limitations of classical algorithm we proposed an improved algorithm in this paper with a aim of minimizing the temporal and spatial complexities by cutting off the database scans to one by generating compressed data structure bit matrix(b_matrix)-and by reducing redundant computations for extracting regular itemsets using top down method. theoritical analysis and experimental results shows that improved algorithm is better than classical apriori algorithm

An Efficient Routing Implementation for Irregular Networks

with the recent advancements in multi-core era workstation clusters have emerged as a cost-effective approach to build a network of workstations NOWs NOWs connect the small groups of processors to a network of switching elements that form irregular topologies Designing an efficient routing and a deadlock avoidance algorithm for irregular networks is quite complicated in terms of latency and area of the routing tables thus impractical for scalability of On Chip Networks Many deadlock free routing mechanisms have been proposed for regular networks but they cannot be employed in irregular networks In this paper a new methodology has been proposed for efficient routing scheme called LBDR-UD which save the average 64 59 routing tables in the switch for irregular networks as compare to up down routing The Basic concept of routing scheme is combination of up down and Logic Based Distributed Routing By simulation it has been shown that the LBDR-UD is deadlock free and adaptive to all dynamic network traffic condition

Intensifying the Security of Multiomodal Biometric Authentication System using Watermarking

In Multimodal biometrics system two or more biometric attributes are combined which makes it far more secure than unimodal system as it nullifies all the vulnerabilities of it. But with the prompt ontogenesis of information technology, even the biometric data is not secure. There is one such technique that is implemented to secure the biometric data from inadvertent or deliberate attacks is known as Digital watermarking. This paper postulate an approach that is devise in both the directions of enlarging the security through watermarking technique and improving the efficiency of biometric identification system by going multimodal. Three biometric traits are consider in this paper two of them are physical traits i.e. ; face, fingerprint and one is behavioral trait (signature).The biometric traits are initially metamorphose using Discrete Wavelet and Discrete Cosine Transformation and then watermarked using Singular Value Decomposition. Scheme depiction and presented results rationalize the effectiveness of the scheme

Energy Efficient Network Generation for Application Specific NoC

Networks-on-Chip is emerging as a communication platform for future complex SoC designs, composed of a large number of homogenous or heterogeneous processing resources. Most SoC platforms are customized to the domainspecific requirements of their applications, which communicate in a specific, mostly irregular way. The specific but often diverse communication requirements among cores of the SoC call for the design of application-specific network of SoC for improved performance in terms of communication energy, latency, and throughput. In this work, we propose a methodology for the design of customized irregular network architecture of SoC. The proposed method exploits priori knowledge of the application2019;s communication characteristic to generate an energy optimized network and corresponding routing tables

An Enhanced Wavelet based Image Compression Technique

With the fast expansion of multimedia technologies, the compression of multimedia data has become an important aspect. Image compression is important for efficient storage and transmission of images. The limitation in bandwidth of wireless channels has made data compression a necessity. Wireless channels are bandwidth limited and due to this constraint of wireless channels, progressive image transmission has gained much popularity and acceptance. The Embedded Zerotree Wavelet algorithm (EZW) is based on progressive encoding, in which bits in the bit stream are generated in order of importance. The EZW algorithm, code all the frequency band of wavelet coefficients as the same importance without considering the amount of information in each frequency band. This paper presents an enhanced wavelet based approach to overcome the limitation of the Embedded Zerotree Wavelet (EZW) algorithm. This method divides the image into some sub-blocks

Energy Efficient Cluster based Multipath Routing in Wireless Sensor Networks

Wireless sensor network can be defined as a network of densely deployed sensor nodes. These sensor nodes have limited energy and have low processing and storage capabilities. Due to this, we require energy efficient routing protocols so that much of the energy of the nodes is not wasted in routing of data packets. In this paper, we present and energy efficient routing scheme. This routing protocol is a combination of cluster-based routing and multipath routing. We arrange all the sensor nodes in the network in the form of small clusters. Each of these clusters has a cluster head. Nodes which lie within a cluster send its data to its respective cluster head. The transfer of data from nodes to cluster head is through direct communication. All the cluster heads transfer their data to the sink or base station. This transfer of data is through multipath routing

An Effecient Misbehaving Node Detection Algorithm in Manet

Manet is a collection of self-organizing mobile nodes participating in the network to forward packets for each other However some nodes in the network do not forward packets in order to save their energy But these nodes make use of other nodes to forward their packets Such unfair use of the network leads to degradation of its performance So it is very important to detect such misbehaving nodes in the network So in order to improve network performance we propose a scheme that is a combination of overhearing and acknowledgement based method to detect misbehaving nodes The scheme is proposed to be built on top of DSR routing protoco

Network Path Discovery Mechanism for Failures in Mobile Ad hoc Networks

Mobile Ad-Hoc Networks (MANET) are form of wireless networks in which nodes can configure by themselves in free and dynamic manner to form temporary network topology. These networks do not have any fixed infrastructure and any centralized administration. Routing is the most challenging task in MANETs as the network topology keeps on changing due to mobility of nodes. Routing involves task of discovering route to destination node for a source to send data packets. In MANET, as there is no fixed infrastructure, nodes act as routers or packet forwarding devices. Ad-hoc On Demand Distance Vector (AODV) routing protocol used for routing in MANETs is considered most suited for such networks and is selected for introducing a new approach for path discovery. AODV looks for route only when any of the node is having data packets ready to be sent to some destination. But under node mobility and variable node density the performance of AODV reduced. In this paper a Network Path Discovery AODV protocol (NPDAODV) is proposed, which considers node speed, signal strength, distance between nodes and queue occupancy while discovering network path. Also the newly proposed protocol is compared with AMAODV, an earlier work. Network Simulator (NS2) is used to perform the comparative simulations to study the proposed work

Energy Efficient Branch and Bound based On-Chip Irregular Network Design

Here we present a technique which construct the topology for heterogeneous SoC, (Application Specific NoC) such that total Dynamic communication energy is optimized. The topology is certain to satisfy the constraints of node degree as well the link length. We first layout the topology by finding the shortest path between traffic characteristics with the branch and bound optimization technique. Deadlock is dealt with escape routing using Spanning tree. Investigation outcome show that the proposed design methodology is fast and achieves significant dynamic energy gain